Speeding up biomolecular interactions by molecular sledding
نویسندگان
چکیده
منابع مشابه
Speeding up biomolecular interactions by molecular sledding
Numerous biological processes involve association of a protein with its binding partner, an event that is preceded by a diffusion-mediated search bringing the two partners together. Often hindered by crowding in biologically relevant environments, three-dimensional diffusion can be slow and result in long bimolecular association times. Similarly, the initial association step between two binding...
متن کاملSpeeding up biomolecular interactions by molecular sledding† †Electronic supplementary information (ESI) available: Synthesis procedures, experimental procedures and Fig. S1–S11. See DOI: 10.1039/c5sc03063c Click here for additional data file.
Numerous biological processes involve association of a protein with its binding partner, an event that is preceded by a diffusion-mediated search bringing the two partners together. Often hindered by crowding in biologically relevant environments, three-dimensional diffusion can be slow and result in long bimolecular association times. Similarly, the initial association step between two binding...
متن کاملSpeeding up computations via molecular biology
We show how to extend the recent result of Adleman 1] to use biological experiments to directly solve any NP problem. We, then, show how to use this method to speedup a large class of important problems.
متن کاملSpeeding up deciphering by hypergraph ordering
The “Gluing Algorithm” of Semaev [Des. Codes Cryptogr. 49 (2008), 47–60] — that finds all solutions of a sparse system of linear equations over the Galois field GF (q) — has average running time O(mq| k 1Xj |), where m is the total number of equations, and ∪k1Xj is the set of all unknowns actively occurring in the first k equations. Our goal here is to minimize the exponent of q in the case whe...
متن کاملSpeeding Up FastICA by Mixture Random Pruning
We study and derive a method to speed up kurtosis-based FastICA in presence of information redundancy, i.e., for large samples. It consists in randomly decimating the data set as more as possible while preserving the quality of the reconstructed signals. By performing an analysis of the kurtosis estimator, we find the maximum reduction rate which guarantees a narrow confidence interval of such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemical Science
سال: 2016
ISSN: 2041-6520,2041-6539
DOI: 10.1039/c5sc03063c